Перевод: с английского на все языки

со всех языков на английский

higher-order predicate

См. также в других словарях:

  • Higher-order logic — In mathematics, higher order logic is distinguished from first order logic in a number of ways.One of these is the type of variables appearing in quantifications; in first order logic, roughly speaking, it is forbidden to quantify over predicates …   Wikipedia

  • Second-order predicate — In mathematical logic, a second order predicate is a predicate that takes a first order predicate as an argument. Compare higher order predicate.The idea of second order predication was introduced by the German mathematician and philosopher Frege …   Wikipedia

  • First-order predicate — A first order predicate (also called a monad) is a predicate that takes only individual(s) constants or variables as argument(s). Compare second order predicate and higher order predicate. ee also*First order predicate calculus *Monadic predicate …   Wikipedia

  • Filter (higher-order function) — In functional programming, filter is a higher order function that processes a data structure (typically a list) in some order to produce a new data structure containing exactly those elements of the original data structure for which a given… …   Wikipedia

  • Fold (higher-order function) — In functional programming, fold, also known variously as reduce, accumulate, compress or inject, is a family of higher order functions that process a data structure in some order and build up a return value. Typically, a fold deals with two… …   Wikipedia

  • Predicate variable — In first order logic, a predicate variable is a predicate letter which can stand for a relation (between terms) but which has not been specifically assigned any particular relation (or meaning). In first order logic (FOL) they can be more… …   Wikipedia

  • Predicate transformer semantics — is an extension of Floyd Hoare Logic invented by Dijkstra and extended and refined by other researchers. It was first introduced in Dijkstra s paper Guarded commands, nondeterminacy and formal derivation of programs . It is a method for defining… …   Wikipedia

  • predicate calculus — Logic. See functional calculus. Also called predicate logic. [1945 50] * * * Part of modern symbolic logic which systematically exhibits the logical relations between propositions involving quantifiers such as all and some. The predicate calculus …   Universalium

  • Predicate functor logic — In mathematical logic, predicate functor logic (PFL) is one of several ways to express first order logic (formerly known as predicate logic) by purely algebraic means, i.e., without quantified variables. PFL employs a small number of algebraic… …   Wikipedia

  • predicate calculus — The logical calculus in which the expressions include predicate letters, variables, and quantifiers, names, and operation letters, as well as the expressions for truth functions and the propositional variables of the propositional calculus . The… …   Philosophy dictionary

  • First-order logic — is a formal logical system used in mathematics, philosophy, linguistics, and computer science. It goes by many names, including: first order predicate calculus, the lower predicate calculus, quantification theory, and predicate logic (a less… …   Wikipedia

Поделиться ссылкой на выделенное

Прямая ссылка:
Нажмите правой клавишей мыши и выберите «Копировать ссылку»